Dynamic Edit Distance Table under a General Weighted Cost Function
نویسندگان
چکیده
منابع مشابه
Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملAn Optimal Approach towards Sequence Analysis
Dynamic programming is a form of recursion in which intermediate results are saved in a matrix where they can be refereed to later by the program. The paper aims at presenting the calculation of the edit distance between two given strings which includes a cost factor for the different edit operations like copy, insert and delete. The method used in this paper is a form of dynamic programming wh...
متن کاملEdit Distance with Duplications and Contractions Revisited
In this paper, we propose three algorithms for the problem of string edit distance with duplication and contraction operations, which improve the time complexity of previous algorithms for this problem. These include a faster algorithm for the general case of the problem, and two improvements which apply under certain assumptions on the cost function. The general algorithm is based on fast min-...
متن کاملEdit-Distance Of Weighted Automata: General Definitions And Algorithms
The problem of computing the similarity between two sequences arises in many areas such as computational biology and natural language processing. A common measure of the similarity of two strings is their edit-distance, that is the minimal cost of a series of symbol insertions, deletions, or substitutions transforming one string into the other. In several applications such as speech recognition...
متن کاملA framework for cost-constrained genome rearrangement under Double Cut and Join
The study of genome rearrangement has many flavours, but they all are somehow tied to edit distances on variations of a multi-graph called the breakpoint graph. We study a weighted 2-break distance on Eulerian 2-edge-colored multi-graphs, which generalizes weighted versions of several Double Cut and Join problems, including those on genomes with unequal gene content. We affirm the connection be...
متن کامل